Minimum Spanning Tree with Uncertain Random Weights

This paper considers the minimum spanning tree problem with uncertain random weights in an uncertain random network. The concept of uncertain random minimum spanning tree is initiated for minimum spanning tree problem with uncertain random edge weights. A model is presented to formulate a specific minimum spanning tree problem with uncertain random edge weights involving a distance chance distribution model. The distance chance distribution model is one of minimum spanning tree of a deterministic network which can be solved by an optimization methods. Finally, a numerical example on an uncertain random network is put forward to illustrate the effectiveness of the proposed model and algroithm.